Global optimization with space-filling curves
نویسندگان
چکیده
منابع مشابه
Unconventional Space-filling Curves
A 2-dimensional space-filling curve, here, is a surjective continuous map from an interval to a 2-dimensional space. To construct a new space-filling curve distinct and much different from Hilbert’s, Peano’s, and the Z-order, we first observe that all three of these curves are based on self-similar fractals–in particular, the recursive definition of the sequences of functions that converge to t...
متن کاملSynthesis of Space-Filling Curves Through Measure- Preserving Transformations and Their Application to Global Optimization
This paper proposes a new multi-start, stochastic global optimization algorithm that uses dimensional reduction techniques based upon approximations of space-filling curves and simulated annealing, aiming to find global minima of real-valued (possibly multimodal) functions that are not necessarily well behaved, that is, are not required to be differentiable, continuous, or even satisfying Lipsc...
متن کاملDeterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Holder constants
In this paper, the global optimization problem miny∈S F (y) with S being a hyperinterval in R and F (y) satisfying the Lipschitz condition with an unknown Lipschitz constant is considered. It is supposed that the function F (y) can be multiextremal, non-differentiable, and given as a ‘black-box’. To attack the problem, a new global optimization algorithm based on the following two ideas is prop...
متن کاملClustering Microarray Data with Space Filling Curves
We introduce a new clustering method for DNA microarray data that is based on space filling curves and wavelet denoising. The proposed method is much faster than the established fuzzy c-means clustering because clustering occurs in one dimension and it clusters cells that contain data, instead of data themselves. Moreover, preliminary evaluation results on data sets from Small Round Blue-Cell t...
متن کاملImage Encryption with Space - filling Curves
Conventional encryption techniques are usually applicable for text data and often unsuited for encrypting multimedia objects for two reasons. Firstly, the huge sizes associated with multimedia objects make conventional encryption computationally costly. Secondly, multimedia objects come with massive redundancies which are useful in avoiding encryption of the objects in their entirety. Hence a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1999
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(99)00134-2